1818A - Politics - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define maxheap(type) priority_queue<type>;
#define minheap(type) priority_queue<type,vector<type>,greater<type>>


void solve();

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin>>t; // test case hain kya? 
    while(t--){
        solve();
        cout<<"\n";
    };
    return 0;
}

void solve() {
    int n,k;
    cin>>n>>k;
    vector<string> v(n);
    int ans = 1;
    for(int i=0; i<n; i++){
        cin>>v[i];
        if(i > 0){
            if(v[i] == v[0]){
                ans++;
            }
        }
    }
    cout<<ans;
}